Paramodulation (Some Notes)
نویسنده
چکیده
For example, consider a structure with domain (A,B,C), for a language including just the equality predicate = and constants {a, b, c}, which interprets a, b, c as A,B,C respectively and = as the relation {(A,B), (B,A), (A,A), (B,B), (C,C)}. i.e. = (A,B),= (B,A) etc. are all true and other atoms involving =, such as = (B,C), are false. This is a model of the equality axioms (show it !) and it also satisfies the formula a = b (for example). However, a and b do not denote the same element in the domain, so equality is not being treated as identity here.
منابع مشابه
Lock, Linear Lambda-Paramodulation in Operator Fuzzy Logic
The author proposed concepts of Operator Fuzzy Logic and-Resolution in 1984. He and his cooperaters have obtained some theoretical results. This paper introduces-paramodulation to handle a set of clauses with the predicate of equality, and thus the equality substitution can be used in fuzzy reasoning. Then the-paramodulation method is proved to be complete with lock-semantic method. Finally, Ya...
متن کاملWell-Foundedness Is Sufficient for Completeness of Ordered Paramodulation
For many years all known completeness results for Knuth-Bendix completion and ordered paramodulation required the term ordering to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By using ...
متن کاملAutomatic Decidability: A Schematic Calculus for Theories with Counting Operators
Many verification problems can be reduced to a satisfiability problem modulo theories. For building satisfiability procedures the rewriting-based approach uses a general calculus for equational reasoning named paramodulation. Schematic paramodulation, in turn, provides means to reason on the derivations computed by paramodulation. Until now, schematic paramodulation was only studied for standar...
متن کاملParamodulation with Well-founded Orderings
For many years, all existing completeness results for KnuthBendix completion and ordered paramodulation required the term ordering ≻ to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By u...
متن کاملCategory-based Semantic Paramodulation
We introduce the concept of semantic paramodulation as a \semantic" de nition of paramodulation (in the sense that it applies to any model, not only to the term algebra) within the framework of category-based equational logic (introduced by [8, 9]). This not only generalises the traditional syntactic approaches to paramodulation, but also provides an abstract framework for a uni ed treatment of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004